منابع مشابه
8-Shredders in 8-Connected Graphs
For a graph G, a subset S of V (G) is called a shredder if G − S consists of three or more components. We show that if G is an 8-connected graph of order at least 177, then the number of shredders of cardinality 8 of G is less than or equal to (2|V (G)| − 10)/3.
متن کامل10-Shredders in 10-Connected Graphs
For a graph G, a subset S of V (G) is called a shredder if G− S consists of three or more components. We show that if G is a 10-connected graph of order at least 4227, then the number of shredders of cardinality 10 of G is less than or equal to (2|V (G)| − 11)/3.
متن کامل(t, k)-Shredders in k-Connected Graphs
Let t, k be integers with t ≥ 3 and k ≥ 1. For a graph G, a subset S of V (G) with cardinality k is called a (t, k)-shredder if G−S consists of t or more components. In this paper, we show that if t ≥ 3, 2(t−1) ≤ k ≤ 3t−5 and G is a k-connected graph of order at least k, then the number of (t, k)-shredders of G is less than or equal to ((2t−1)(|V (G)|−f(|V (G)|)))/(2(t−1)), where f(n) denotes t...
متن کامل9-Shredders in 9-connected graphs
For a graph G, a subset S of V (G) is called a shredder if G − S consists of three or more components. We show that if G is a 9-connected graph of order at least 67, then the number of shredders of cardinality 9 of G is less than or equal to (2|V (G)| − 9)/3. AMS 2010 Mathematics Subject Classification. 05C40
متن کامل5-Connected Toroidal Graphs are Hamiltonian-Connected
The problem on the Hamiltonicity of graphs is well studied in discrete algorithm and graph theory, because of its relation to traveling salesman problem (TSP). Starting with Tutte’s result, stating that every 4-connected planar graph is Hamiltonian, several researchers have studied the Hamiltonicity of graphs on surfaces. Extending Tutte’s technique, Thomassen proved that every 4-connected plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.02.028